基于人工神经网络的操作手IKP 求解

人工神经网络以其信息的并行处理与分布式存储、自组织和自适应等特点,在机器人领域显示了极大的应用潜力。本文探讨人工神经网络在机器人操作手ＩＫＰ求解中的应用,试图求得操作手ＩＫＰ的一组或所有可行解。文章利用ＢＰ网络对操作手ＩＫＰ的求解进行了讨论和分析,并给出了具体的求解实例。     

超视距多目标攻击排序及火力分配建模与解算

针对未来超视距空战条件下的多目标攻击排序和制导武器火力分配问题,提出了一种用以评估超视距空战作战效能的综合优势指数法;当目标数多于攻击机数时,通过构造综合优势矩阵,将非平衡指派问题转化为平衡指派问题,并建立了多目标攻击排序的0-1规划模型,该模型可解决对多个目标同时攻击的排序问题;以2对8攻击排序为例,利用求解线性规划软件Lindo6.0进行解算。最后,建立了1对4攻击火力分配的非线性规划模型,并利用求解非线性规划软件Lingo5.0进行解算。计算结果验证了建模的合理性和运用Lindo、Lingo软件求解较大规模目标攻击排序和火力分配问题的实时性。     

航路规划中大地主题解算的简化方法

介绍了大地主题解算的精确公式:Bowring公式,给出了三种大地主题解算的简化方法,包括:椭球体到圆球体、椭球面到圆球面以及椭球面到平面的简化方法,并分析了各种简化方法的误差大小。     

Heuristics for the multi‐resource generalized assignment problem

The well‐known generalized assignment problem (GAP) involves the identification of a minimum‐cost assignment of tasks to agents when each agent is constrained by a resource in limited supply. The multi‐resource generalized assignment problem (MRGAP) is the generalization of the GAP in which there are a number of different potentially constraining resources associated with each agent. This paper explores heuristic procedures for the MRGAP. We first define a three‐phase heuristic which seeks to construct a feasible solution to MRGAP and then systematically attempts to improve the solution. We then propose a modification of the heuristic for the MRGAP defined previously by Gavish and Pirkul. The third procedure is a hybrid heuristic that combines the first two heuristics, thus capturing their relative strengths. We discuss extensive computational experience with the heuristics. The hybrid procedure is seen to be extremely effective in solving MRGAPs, generating feasible solutions to more than 99% of the test problems and consistently producing near‐optimal solutions. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 468–483, 2001     

Clustered coverage orienteering problem of unmanned surface vehicles for water sampling

This study investigates a clustered coverage orienteering problem (CCOP), which is a generalization of the classical orienteering problem. The problem is widely motivated by the emerging unmanned techniques (eg, unmanned surface vehicles and drones) applied to environmental monitoring. Specifically, the unmanned surface vehicles (USVs) are used to monitor reservoir water quality by collecting samples. In the CCOP, the water sampling sites (ie, the nodes) are grouped into clusters, and a minimum number of nodes must be visited in each cluster. With each node representing a certain coverage area of the water, the objective of the CCOP is to monitor as much as possible the total coverage area in one tour of the USV, considering that overlapping areas provide no additional information. An integer programming model is first formulated through a linearization procedure that captures the overlapping feature. A two-stage exact algorithm is proposed to obtain an optimal solution to the problem. The efficiency and effectiveness of the two-stage exact algorithm are demonstrated through experiments on randomly generated instances. The algorithm can effectively solve instances with up to 60 sampling sites.     

装甲装备战斗毁伤模拟策略研究

战损规律数据是装备寿命周期各项BDAR工作的重要依据,结合物理试验数据进行战斗毁伤模拟是获取战损数据的重要途径,随着新技术手段的不断出现为探索毁伤模拟方法提供了新的契机.为此归纳总结了装甲装备战斗毁伤模拟的问题特征,综述了国内外的研究现状并剖析了现行方法对问题的解决程度,在此基础上提出了引入复杂系统的研究方法,基于三维元胞自动机和Agent技术建立了模型的仿真框架,说明了依据该方法进行问题研究的有效性和前瞻性.     

Noncooperative cost spanning tree games with budget restrictions

We extend the noncooperative game associated with the cost spanning tree problem introduced by Bergantiños and Lorenzo (Math Method Oper Res 59(2004), 393–403) to situations where agents have budget restrictions. We study the Nash equilibria, subgame perfect Nash equilibria, and strong Nash equilibria of this game. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

火灾统计失实问题的现状及对策

以四川省为例介绍火灾统计失实的情况 ,并分析火灾统计失实问题的原因 ,提出纠正火灾统计失实问题的工作意见。     

评估航空重力系统误差及向下延拓的逆泊松半参数方法

常用航空重力系统误差事后处理方法需外部重力数据,但很多地区无外部重力数据。研究发现,半参数模型可在无外部数据时估计系统误差。先用自然样条函数为系统误差建模,后用补偿最小二乘法和光滑参数求解,最后用广义交叉核实法(不需要先验信息)选取光滑参数。将半参数模型用于向下延拓逆泊松积分,建立逆泊松半参数混合模型,既可无外部重力时估计系统误差,又可向下延拓。实验结果表明:无外部重力时逆泊松积分和最小二乘配置法受系统误差影响最大,向下延拓精度最差;正则化算法可减弱系统误差影响,向下延拓精度较好;逆泊松半参数混合模型可估计系统误差,向下延拓精度最好。     

Optimal source placement for point coverage in active multistatic sonar networks

The allocation of underwater sensors for tracking, localization, and surveillance purposes is a fundamental problem in anti-submarine warfare. Inexpensive passive receivers have been heavily utilized in recent years; however, modern submarines are increasingly quiet and difficult to detect with receivers alone. Recently, the idea of deploying noncollocated sources and receivers has emerged as a promising alternative to purely passive sensor fields and to traditional sonar fields composed of collocated sources and receivers. Such a multistatic sonar network carries a number of advantages, but it also brings increased system complexity resulting from its unusual coverage patterns. In this work, we study the problem of optimally positioning active multistatic sonar sources for a point coverage application where all receivers and points of interest are fixed and stationary. Using a definite range sensor model, we formulate exact methods and approximation algorithms for this problem and compare these algorithms via computational experiments. We also examine the performance of these algorithms on a discrete approximation of a continuous area coverage problem and find that they offer a significant improvement over two types of random sensor deployment.